Local and global price of anarchy of graphical games
نویسندگان
چکیده
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.
منابع مشابه
The Local and Global Price of Anarchy of Graphical Games
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.
متن کاملPrice of Anarchy⋆
Internet users, auction bidders, and stock buyers are examples of agents who are selfishly trying to maximize their own benefit without necessarily caring the global objective of the underlying game such as the overall load on the network or the overall satisfaction of agents. How does these two points of view (agents vs. global) correlate? How much does the society suffer by the lack of coordi...
متن کاملOpinion Formation Games with Aggregation and Negative Influence
We study continuous opinion formation games with aggregation aspects. In many domains, expressed opinions of people are not only affected by local interaction and personal beliefs, but also by influences that stem from global properties of the opinions in the society. To capture the interplay of such global and local effects, we propose a model of opinion formation games with aggregation, where...
متن کاملOn the Performance of Congestion Games for Optimum Satisfiability Problems
We introduce and study a congestion game having max sat as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for max sat with locality gap 2/3. A similar congestion min sat game is also studied. keywords: price of anarchy, non obli...
متن کاملPrice of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related facility location problem called the k-facility location problem. As a result, we show that the kfacility location problem has a locality gap of 5. This result is of interest on its own. Our result gives evidence to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011